Tight Lower Bound for Linear Sketches of Moments
نویسندگان
چکیده
The problem of estimating frequency moments of a data stream has attracted a lot of attention since the onset of streaming algorithms [AMS99]. While the space complexity for approximately computing the p moment, for p ∈ (0, 2] has been settled [KNW10], for p > 2 the exact complexity remains open. For p > 2 the current best algorithm uses O(n1−2/p logn) words of space [AKO11,BO10], whereas the lower bound is of Ω(n1−2/p) [BJKS04]. In this paper, we show a tight lower bound of Ω(n1−2/p logn) words for the class of algorithms based on linear sketches, which store only a sketch Ax of input vector x and some (possibly randomized) matrix A. We note that all known algorithms for this problem are linear sketches.
منابع مشابه
A Tight Lower Bound for High Frequency Moment Estimation with Small Error
We show an Ω((n1−2/p logM)/ ) bits of space lower bound for (1 + )-approximating the p-th frequency moment Fp = ‖x‖p = ∑n i=1 |xi| of a vector x ∈ {−M,−M+1, . . . ,M} with constant probability in the turnstile model for data streams, for any p > 2 and ≥ 1/n (we require ≥ 1/n since there is a trivial O(n logM) upper bound). This lower bound matches the space complexity of an upper bound of Gangu...
متن کاملA bound for Feichtinger conjecture
In this paper, using the discrete Fourier transform in the finite-dimensional Hilbert space C^n, a class of nonRieszable equal norm tight frames is introduced and using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...
متن کاملTracking the Frequency Moments at All Times
The traditional requirement for a randomized streaming algorithm is just one-shot, i.e., algorithm should be correct (within the stated ε-error bound) at the end of the stream. In this paper, we study the tracking problem, where the output should be correct at all times. The standard approach for solving the tracking problem is to run O(logm) independent instances of the one-shot algorithm and ...
متن کاملThe Simultaneous Communication of Disjointness with Applications to Data Streams
We study k-party set disjointness in the simultaneous message-passing model, and show that even if each element i ∈ [n] is guaranteed to either belong to all k parties or to at most O(1) parties in expectation (and to at most O(logn) parties with high probability), then Ω(nmin(log 1/δ, log k)/k) communication is required by any δ-error communication protocol for this problem (assuming k = Ω(log...
متن کاملTight Bounds for Linear Sketches of Approximate Matchings
We resolve the space complexity of linear sketches for approximating the maximum matching problem in dynamic graph streams where the stream may include both edge insertion and deletion. Specifically, we show that for any ǫ > 0, there exists a one-pass streaming algorithm, which only maintains a linear sketch of size Õ(n) bits and recovers an n-approximate maximum matching in dynamic graph strea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013